A Neutral Information Model for Simulating Machine Shop Operations

نویسندگان

  • P. J. Sánchez
  • D. Ferrin
  • Y. Tina Lee
  • Charles McLean
  • Guodong Shao
چکیده

Small machine shops typically do not have the resources to develop custom simulations of their operations or data translators to import their data from other manufacturing software applications. This paper presents an overview of an information model currently under development at the National Institute of Standards and Technology (NIST) to address this problem. The model provides neutral data interfaces for integrating machine shop software applications with simulation. The information model provides mechanisms for describing data about organizations, calendars, work, resources, schedules, parts, process plans, and layouts within a machine shop environment. The model has been developed using the Unified Modeling Language (UML) and the Extensible Markup Language (XML).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Simulated Annealing Algorithm for Multi Objective Flexible Job Shop Scheduling with Overlapping in Operations

In this paper, we considered solving approaches to flexible job shop problems. Makespan is not a good evaluation criterion with overlapping in operations assumption. Accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. As overlapping in operations is a practical assumption in chemical, petrochemical, and gla...

متن کامل

A neutral data interface specification for simulating machine shop operations

In most cases, the effort required to develop a meaningful simulation for a small machine shop exceeds the resources available. Machine shops typically do not have staff with appropriate technical qualifications required to develop custom simulations of their operations. Furthermore, simulators are not designed to use traditional shop data in its native format, so models and data import routine...

متن کامل

Flow Shop Scheduling Problem with Missing Operations: Genetic Algorithm and Tabu Search

Flow shop scheduling problem with missing operations is studied in this paper. Missing operations assumption refers to the fact that at least one job does not visit one machine in the production process. A mixed-binary integer programming model has been presented for this problem to minimize the makespan. The genetic algorithm (GA) and tabu search (TS) are used to deal with the optimization...

متن کامل

Generalized Cyclic Open Shop Scheduling and a Hybrid Algorithm

In this paper, we first introduce a generalized version of open shop scheduling (OSS), called generalized cyclic open shop scheduling (GCOSS) and then develop a hybrid method of metaheuristic to solve this problem. Open shop scheduling is concerned with processing n jobs on m machines, where each job has exactly m operations and operation i of each job has to be processed on machine i . However...

متن کامل

Optimality of the flexible job shop scheduling system based on Gravitational Search Algorithm

The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003